A search tree is a structuring of a search space into a tree strycture. In some cases this is becasue the problem consists of states and moves so there is a natural tree structure with the start state as root and each possible move as a branch. In other cases where there is a set of paarmeters, the root may be the state with no parameters defined, and each branch fixing the parameters in order; in such cases the order in which the paramters are fixed can substantially affect the efficiency of the search.
Used in Chap. 4: pages 43, 45, 48, 50, 52, 53, 54, 56, 58, 60, 61; Chap. 11: pages 168, 169; Chap. 22: page 368
Also known as tree search
Magic square – search tree of potential solutions.